An Efficient Maximization Algorithm With Implications in Min-Max Predictive Control

n this technical note, an algorithm for binary quadratic programs defined by matrices with band structure is proposed. It was shown in the article by T. Alamo, D. M. de la Pentildea, D. Limon, and E. F. Camacho, ldquoConstrained min-max predictive control: modifications of the objective function leading to polynomial complexity,rdquo IEEE Tran. Autom. Control , vol. 50, pp. 710-714, May 2005, that this class of problems arise in robust model predictive control when min-max techniques are applied. Although binary quadratic problems belongs to a class of NP-complete problems, the computational burden of the proposed maximization algorithm for band matrices is polynomial with the dimension of the optimization variable and exponential with the band size. Computational results and comparisons on several hundred test problems demonstrate the efficiency of the algorithm

Min–max MPC using a tractable QP problem

Min–max model predictive controllers (MMMPC) suffer from a great computational burden that is often circumvented by using approximate solutions or upper bounds of the worst possible case of a performance index. This paper proposes a computationally efficient MMMPC control strategy in which a close approximation of the solution of the min–max problem is computed using a quadratic programming problem. The overall computational burden is much lower than that of the min–max problem and the resulting control is shown to have a guaranteed stability. A simulation example is given in the paper

Min-max model predictive control as a quadratic program

This paper deals with the implementation of min-max model predictive control for constrained linear systems with bounded additive uncertainties and quadratic cost functions. This type of controller has been shown to be a continuous piecewise affine function of the state vector by geometrical methods. However, no algorithm for computing the explicit solution has been given. In this paper, we show that the min-max optimization problem can be expressed as a multi-parametric quadratic program, and so, the explicit form of the controller may be determined by standard multi-parametric techniques

Min-Max MPC based on a computationally efficient upper bound of the worst case cost

Min-Max MPC (MMMPC) controllers [P.J. Campo, M. Morari, Robust model predictive control, in: Proc. American Control Conference, June 10–12, 1987, pp. 1021–1026] suffer from a great computational burden which limits their applicability in the industry. Sometimes upper bounds of the worst possible case of a performance index have been used to reduce the computational burden. This paper proposes a computationally efficient MMMPC control strategy in which the worst case cost is approximated by an upper bound based on a diagonalization scheme. The upper bound can be computed with O(n3) operations and using only simple matrix operations. This implies that the algorithm can be coded easily even in non-mathematical oriented programming languages such as those found in industrial embedded control hardware. A simulation example is given in the paper

Model predictive control techniques for hybrid systems

This paper describes the main issues encountered when applying model predictive control to hybrid processes. Hybrid model predictive control (HMPC) is a research field non-fully developed with many open challenges. The paper describes some of the techniques proposed by the research community to overcome the main problems encountered. Issues related to the stability and the solution of the optimization problem are also discussed. The paper ends by describing the results of a benchmark exercise in which several HMPC schemes were applied to a solar air conditioning plant.Ministerio de Eduación y Ciencia DPI2007-66718-C04-01Ministerio de Eduación y Ciencia DPI2008-0581

Single-layer economic model predictive control for periodic operation

In this paper we consider periodic optimal operation of constrained periodic linear systems. We propose an economic model predictive controller based on a single layer that unites dynamic real time optimization and control. The proposed controller guarantees closed-loop convergence to the optimal periodic trajectory that minimizes the average operation cost for a given economic criterion. A priori calculation of the optimal trajectory is not required and if the economic cost function is changed, recursive feasibility and convergence to the new periodic optimal trajectory is guaranteed. The results are demonstrated with two simulation examples, a four tank system, and a simplified model of a section of Barcelona's water distribution network.Peer ReviewedPostprint (author’s final draft

Oracle-based economic predictive control

Article number 107434This paper presents an economic model predictive controller, under the assumption that the only mea- surable signal of the plant is the economic cost to be minimized. In order to forecast the evolution of this economic cost for a given input trajectory, a prediction model with a NARX structure, the so-called oracle, is proposed. Sufficient conditions to ensure the existence of such oracle are studied, proving that it can be derived for a general nonlinear system if the economic cost function is a Morse function. Based on this oracle, economic model predictive controllers are proposed, and their stability is demonstrated in nominal conditions under a standard dissipativity assumption. The viability of these controllers in practi- cal settings (where the oracle may provide imperfect predictions for generic inputs) is proven by means of input-to-state stability. These properties have been illustrated in a case study based on a continuously stirred tank reactorMinisterio de Economía y Competitividad (MINECO). España DPI2016-76493-C3-1-RAgencia Estatal de Investigación (AEI) PID2019-106212RB-C41/AEI/10.13039/50110001103

An Application of Cooperative Game Theory to Distributed Control

18th World CongressThe International Federation of Automatic ControlMilano (Italy) August 28 - September 2, 2011In this paper we propose to study the underlying properties of a given distributed control scheme in which a set of agents switch between different communication strategies that define which network links are used in order to regulate to the origin a set of unconstrained linear systems. The problems of how to decide the time-varying communication strategy, share the benefits/costs and detect which are the most critical links in the network are solved using tools from game theory. The proposed scheme is demonstrated through a simulation example

Sistema de Evaluación Automática Vía Web en Asignaturas Prácticas de Ingeniería

En este trabajo se presenta una nueva herramienta web para educación que permite automatizar la recogida y evaluación de ejercicios prácticos de diferentes disciplinas de ingeniería con la complejidad típica que la formación técnica requiere. Una de las principales características de la herramienta propuesta es la posibilidad de personalizar los ejercicios para cada alumno. El sistema realiza una comparación funcional de las soluciones propuestas por los alumnos con las soluciones correctas proporcionadas por el profesorado y en función de los resultados obtenidos asigna una calificación al alumno de forma automática. La plataforma permite al profesor implementar técnicas innovadoras de docencia que fomentan el autoaprendizaje en cursos numerosos. Se presentan los resultados de uso del sistema de evaluación en dos cursos, uno de Teoría de Sistemas y otro de Fundamentos de Informática.Universidad de Sevilla I Plan Propio de Docenci

Risk-Aware Wasserstein Distributionally Robust Control of Vessels in Natural Waterways

In the realm of maritime transportation, autonomous vessel navigation in natural inland waterways faces persistent challenges due to unpredictable natural factors. Existing scheduling algorithms fall short in handling these uncertainties, compromising both safety and efficiency. Moreover, these algorithms are primarily designed for non-autonomous vessels, leading to labor-intensive operations vulnerable to human error. To address these issues, this study proposes a risk-aware motion control approach for vessels that accounts for the dynamic and uncertain nature of tide islands in a distributionally robust manner. Specifically, a model predictive control method is employed to follow the reference trajectory in the time-space map while incorporating a risk constraint to prevent grounding accidents. To address uncertainties in tide islands, a novel modeling technique represents them as stochastic polytopes. Additionally, potential inaccuracies in waterway depth are addressed through a risk constraint that considers the worst-case uncertainty distribution within a Wasserstein ambiguity set around the empirical distribution. Using sensor data collected in the Guadalquivir River, we empirically demonstrate the performance of the proposed method through simulations on a vessel. As a result, the vessel successfully navigates the waterway while avoiding grounding accidents, even with a limited dataset of observations. This stands in contrast to existing non-robust controllers, highlighting the robustness and practical applicability of the proposed approach